Measure algebras of semilattices with finite breadth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semilattices of Breadth Three

A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality א2, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of א1 dense subsets in posets of ...

متن کامل

Large semilattices of breadth three

A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality א2, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of א1 dense subsets in posets of ...

متن کامل

Conservative Median Algebras and Semilattices

We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological structures, we obtain descriptions of the median-preserving mappings between products of finitely many chains.

متن کامل

Tractable Constraints in Finite Semilattices

time algorithms for testing the satissability of propositional horn formulae. 21. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value-calculus using a stack of regions.

متن کامل

Tractable Constraints in Finite Semilattices

We introduce the notion of definite inequality constraints involving monotone functions in a finite meet-semJlattice, generalizing the logical notion of Horn-clauses, and we give a linear time algorithm for deciding satisfiability. We characterize the expressiveness of the framework of definite constraints and show that the algorithm uniformly solves exactly the set of all meet-closed relationa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1977

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1977.69.125